Evaluating Consistency Algorithms for Temporal Metric Constraints
نویسندگان
چکیده
We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the 4STP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that 4STP is the most efficient for determining the consistency of an STP, and that incBF combined with the heuristics of (Xu & Choueiry 2003b) is the most efficient for solving the TCSP. We plan to improve 4STP by exploiting incrementality as in incBF and other new incremental algorithms.
منابع مشابه
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric pointbased constraints, where each disjunct in each input disjunctive constraint is univocally associated to a l...
متن کاملOn Finding a Solution in Temporal Constraint Satisfaction Problems
Computing a consistent interpretation of the variables involved in a set of temporal constraints is an important task for many areas of AI requiring temporal reasoning. We focus on the important classes of the qualitative relations in Nebel and Biirckert's ORD-Horn algebra , and of the metric constraints forming a STP, possibly augmented with inequations. For these tractable classes we present ...
متن کاملEecient Algorithms for Networks of Quantitative Temporal Constraints
This paper describes two algorithms for networks of quantitative temporal constraints. The rst one is an incremental algorithm for checking the consistency of a set of constraints: it is based on the directional path consistency property, and it is a complete algorithm. The second algorithm relies on a property of shortest paths in a directional path consistent network. We prove this property a...
متن کاملOn point-duration networks for temporal reasoning
We present here a point-duration network formalism which extends the point algebra model to include additional variables that represent durations between points of time. Thereafter the new qualitative model is enlarged for allowing unary metric constraints on points and durations, subsuming in this way several point-based approaches to temporal reasoning. We deal with some reasoning tasks withi...
متن کاملIntegrating Metric and Qualitative Temporal Reasoning
Research in Artiicial Intelligence on constraint-based representations for temporal reasoning has largely concentrated on two kinds of formalisms: systems of simple linear inequalities to encode metric relations between time points, and systems of binary constraints in Allen's temporal calculus to encode qualitative relations between time intervals. Each formalism has certain advantages. Linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004